Что (кто) такое abstract syntax tree - определение
![An abstract syntax tree for the following code for the [[Euclidean algorithm]]:<syntaxhighlight lang="python">
while b ≠ 0:
if a > b:
a := a - b
else:
b := b - a
return a
</syntaxhighlight>](https://commons.wikimedia.org/wiki/Special:FilePath/Abstract syntax tree for Euclidean algorithm.svg?width=200 "An abstract syntax tree for the following code for the [[Euclidean algorithm]]:<syntaxhighlight lang=\"python\">
while b ≠ 0:
if a > b:
a := a - b
else:
b := b - a
return a
</syntaxhighlight>")
Википедия
In computer science, an abstract syntax tree (AST), or just syntax tree, is a tree representation of the abstract syntactic structure of text (often source code) written in a formal language. Each node of the tree denotes a construct occurring in the text.
The syntax is "abstract" in the sense that it does not represent every detail appearing in the real syntax, but rather just the structural or content-related details. For instance, grouping parentheses are implicit in the tree structure, so these do not have to be represented as separate nodes. Likewise, a syntactic construct like an if-condition-then statement may be denoted by means of a single node with three branches.
This distinguishes abstract syntax trees from concrete syntax trees, traditionally designated parse trees. Parse trees are typically built by a parser during the source code translation and compiling process. Once built, additional information is added to the AST by means of subsequent processing, e.g., contextual analysis.
Abstract syntax trees are also used in program analysis and program transformation systems.
